Experimental Analysis of Space-Bounded Schedulers
نویسندگان
چکیده
منابع مشابه
Experimental Analysis of Different Techniques for Bounded Model Checking
Bounded model checking (BMC) is a procedure that searches for counterexamples to a given property through bounded executions of a non-terminating system. This paper compares the performance of SAT-based, BDD-based and explicit state based BMC on benchmarks drawn from commercial designs. Our experimental framework provides a uniform and comprehensive basis to evaluate each of these approaches. T...
متن کاملSome Remarks on Generalized Sequence Space of Bounded Variation of Sequences of Fuzzy Numbers
The idea of difference sequences of real (or complex) numbers was introducedby Ki zmaz cite{Kizmaz}. In this paper, using the difference operator and alacunary sequence, we introduce and examine the class of sequence $bv_{theta}left( Delta,mathcal{F}right) .$ We study some of its properties likesolidity, symmetricity, etc.
متن کاملSpace-Bounded Query Approximation
When dealing with large amounts of data, exact query answering is not always feasible. We propose a query approximation method that, given an upper bound on the amount of data that can be used (i.e., for which query evaluation is still feasible), identifies a part C of the data D that (i) fits in the available space budget; and (ii) provides accurate query results. That is, for a given query Q,...
متن کاملSpace-Bounded Kolmogorov Extractors
An extractor is a function that receives some randomness and either “improves” it or produces “new” randomness. There are statistical and algorithmical specifications of this notion. We study an algorithmical one called Kolmogorov extractors and modify it to resourcebounded version of Kolmogorov complexity. Following Zimand we prove the existence of such objects with certain parameters. The uti...
متن کاملLecture Space-Bounded Derandomization
We now prove Theorem 1. Let M be a probabilistic machine running in space S (and time 2S), using R random bits, and deciding a language L with two-sided error. (Note that S, R are functions of the input length n, and the theorem requires S = Ω(log n).) We will assume without loss of generality that M always uses exactly R random bits on all inputs. Fixing an input x and letting ` be some parame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Parallel Computing
سال: 2016
ISSN: 2329-4949,2329-4957
DOI: 10.1145/2938389